Relation-Changing Logics as Fragments of Hybrid Logics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relation-Changing Logics as Fragments of Hybrid Logics

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, add, and swap edges in the model, both locally and globally. We provide translations from these logics to hybrid logic along with an implementation....

متن کامل

Bounded-Variable Fragments of Hybrid Logics

Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is undecidable and model checking isPSPACE-hard. It is shown here that on the linear frame (ω,<), the restriction to one name, although expressively complete, has EXPSPACEcomplete satisfiability and polynomial time model-ch...

متن کامل

Intuitionistic Modal Logics as Fragments of Classical Bimodal Logics

Godel's translation of intuitionistic formulas into modal ones provides the well-known embedding of intermediate logics into extensions of Lewis' system S4, which re ects and sometimes preserves such properties as decidability, Kripke completeness, the nite model property. In this paper we establish a similar relationship between intuitionistic modal logics and classical bimodal logics. We als...

متن کامل

Undecidability of Relation-Changing Modal Logics

Relation-changing modal logics are extensions of the basic modal logic that allow to change the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, add and swap edges in the model, both locally and globally. We investigate the satisfiability problem of these logics. We define satisfiability-prese...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2016

ISSN: 2075-2180

DOI: 10.4204/eptcs.226.2